计算机与现代化 ›› 2012, Vol. 198 ›› Issue (2): 22-25.doi: 10.3969/j.issn.10062475.2012.02.007
• 算法设计与分析 • 上一篇 下一篇
张立利1,2，冯萍1，郭宁1
收稿日期:
修回日期:
出版日期:
发布日期:
ZHANG Li-li 1,2,FENG Ping1,GUO Ning1
Received:
Revised:
Online:
Published:
摘要： 邻接法是最有效的距离建树法的一种，但邻接法的聚类过程总是选择距离最近的进行聚类，容易忽略一些更为合理的拓扑结构，这是邻接法准确性不够理想的一个重要原因。为了提高邻接法的准确性，本文结合最大似然法提出一种改进的进化树构建算法。该算法在邻接法基础上，结合最大似然法搜索最优的拓扑结构，通过模拟实验将改进算法与邻接法等进化树构建算法进行比较，实验结果表明，改进算法的准确性明显优于邻接法。
关键词: 进化树, 邻接法, 最大似然法, RF距离, 启发式搜索
Abstract: Neighbor-joining method is one of the most effective methods based on distance data constructing phylogenetic tree.But its clustering process may neglect some more reasonable topological structure and cause low accuracy.In order to advance the accuracy of neighborjoining method, this paper proposes an improved method. The method uses neighbor-joining method to generate an initial tree, and then searches for the maximum-likelihood phylogenetic tree according to RF distance. The experiment results show that the improved method is superior to neighbor-joining method.
Key words: phylogenetic tree, neighbor-joining method, maximum likelihood, RF distance, heuristic search
中图分类号:
TP301.6
张立利;冯萍;郭宁. 一种改进的进化树构建算法[J]. 计算机与现代化, 2012, 198(2): 22-25.
ZHANG Li-li;FENG Ping;GUO Ning. An Improved Algorithm for Constructing Phylogenetic Tree[J]. Computer and Modernization, 2012, 198(2): 22-25.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://www.c-a-m.org.cn/CN/10.3969/j.issn.10062475.2012.02.007
http://www.c-a-m.org.cn/CN/Y2012/V198/I2/22
